Nested HEX-Programs

نویسندگان

  • Thomas Eiter
  • Thomas Krennwallner
  • Christoph Redl
چکیده

Answer-Set Programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (like remote procedure calls) in general. The feature is desired for increasing modularity and—assuming proper access in place—(meta-)reasoning over subprogram results. While HEX-programs extend classical ASP with external source access, they do not support calls of (sub-)programs upfront. We present nested HEX-programs, which extend HEX-programs to serve the desired feature, in a userfriendly manner. Notably, the answer sets of called sub-programs can be individually accessed. This is particularly useful for applications that need to reason over answer sets like belief set merging, user-defined aggregate functions, or preferences of answer sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HEX-Programs with Nested Program Calls

Answer-Set Programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (akin to remote procedure calls) in general. This feature is desired for increasing modularity and—assuming proper access in place—(meta-)reasoning over subprogram results. While HEXprograms extend classi...

متن کامل

Grounding HEX-Programs with Expanding Domains

Recently, liberally domain-expansion safe HEX-programs have been presented as a generalization of strongly safe HEX-programs that enlarges the scope of effective applicability. While such programs can be finitely grounded, a concrete grounding algorithm that is practically useful remained open. In this paper, we present such an algorithm and show how to integrate it into the model-building fram...

متن کامل

Ranking Services Using Fuzzy HEXPrograms

The need to reason with knowledge expressed in both Logic Programming (LP) and Description Logics (DLs) paradigms on the Semantic Web lead to several integrating formalisms, e.g., Description Logic programs (dl-programs) allow a logic program to retrieve results from and feed results to a DL knowledge base. Two functional extensions of dl-programs are HEX programs and fuzzy dl-programs. The for...

متن کامل

Constraint Answer Set Programming Based on HEX-Programs

Constraint Answer Set Programming (CASP) is a convenient integration of the Answer Set Programming (ASP) paradigm with constraint programming (CP), which was exploited for a range of applications. HEX-programs are another extension of ASP towards integration of arbitrary external sources through socalled external atoms. In this work, we integrate HEX-programs with CP, which results in a strict ...

متن کامل

DLV-HEX: Dealing with Semantic Web under Answer-Set Programming

We present an implementation of HEX programs, which are nonmonotonic logic programs admitting higher-order atoms as well as external atoms. Higher-order features are widely acknowledged as useful for various tasks, including meta-reasoning. Furthermore, the possibility to exchange knowledge with external sources in a fully declarative framework such as answer-set programming (ASP) is nowadays i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1108.5626  شماره 

صفحات  -

تاریخ انتشار 2011